Efficient indexing and retrieval of large-scale geo-tagged video databases

We are witnessing a significant growth in the number of smartphone users and advances in phone hardware and sensor technology. In conjunction with the popularity of video applications such as YouTube, an unprecedented number of user-generated videos (UGVs) are being generated and consumed by the public, which leads to a Big Data challenge in social media. In a very large video repository, it is difficult to index and search videos in their unstructured form. However, due to recent development, videos can be geo-tagged (e.g., locations from GPS receiver and viewing directions from digital compass) at the acquisition time, which can provide potential for efficient management of video data. Ideally, each video frame can be tagged by the spatial extent of its coverage area, termed Field-Of-View (FOV). This effectively converts a challenging video management problem into a spatial database problem. This paper attacks the challenges of large-scale video data management using spatial indexing and querying of FOVs, especially maximally harnessing the geographical properties of FOVs. Since FOVs are shaped similar to slices of pie and contain both location and orientation information, conventional spatial indexes, such as R-tree, cannot index them efficiently. The distribution of UGVs’ locations is non-uniform (e.g., more FOVs in popular locations). Consequently, even multilevel grid-based indexes, which can handle both location and orientation, have limitations in managing the skewed distribution. Additionally, since UGVs are usually captured in a casual way with diverse setups and movements, no a priori assumption can be made to condense them in an index structure. To overcome the challenges, we propose a class of new R-tree-based index structures that effectively harness FOVs’ camera locations, orientations and view-distances, in tandem, for both filtering and optimization. We also present novel search strategies and algorithms for efficient range and directional queries on our indexes. Our experiments using both real-world and large synthetic video datasets (over 30 years’ worth of videos) demonstrate the scalability and efficiency of our proposed indexes and search algorithms.     

Image processing acceleration for intelligent unmanned aerial vehicle on mobile GPU

In this paper, we present an algorithm for providing visually-guided unmanned aerial vehicle (UAV) control using visual information that is processed on a mobile graphic processing unit (GPU). Most real-time machine vision applications for UAVs exploit low-resolution images because the shortage of computational resources comes from size, weight and power issue. This leads to the limitation that the data are insufficient to provide the UAV with intelligent behavior. However, GPUs have emerged as inexpensive parallel processors that are capable of providing high computational power in mobile environments. We present an approach for detecting and tracking lines that use a mobile GPU. Hough transform and clustering techniques were used for robust and fast tracking. We achieved accurate line detection and faster tracking performance using the mobile GPU as compared with an x86 i5 CPU. Moreover, the average results showed that the GPU provided approximately five times speedup as compared to an ARM quad-core Cortex-A15. We conducted a detailed analysis of the performance of proposed tracking and detection algorithm and obtained meaningful results that could be utilized in real flight.     

Page segmentation using minimum homogeneity algorithm and adaptive mathematical morphology

Document layout analysis or page segmentation is the task of decomposing document images into many different regions such as texts, images, separators, and tables. It is still a challenging problem due to the variety of document layouts. In this paper, we propose a novel hybrid method, which includes three main stages to deal with this problem. In the first stage, the text and non-text elements are classified by using minimum homogeneity algorithm. This method is the combination of connected component analysis and multilevel homogeneity structure. Then, in the second stage, a new homogeneity structure is combined with an adaptive mathematical morphology in the text document to get a set of text regions. Besides, on the non-text document, further classification of non-text elements is applied to get separator regions, table regions, image regions, etc. The final stage, in refinement region and noise detection process, all regions both in the text document and non-text document are refined to eliminate noises and get the geometric layout of each region. The proposed method has been tested with the dataset of ICDAR2009 page segmentation competition and many other databases with different languages. The results of these tests showed that our proposed method achieves a higher accuracy compared to other methods. This proves the effectiveness and superiority of our method.     

Pseudo-inversion: closure properties and decidability

We consider a pseudo-inversion operation inspired by biological events, such as DNA sequence transformations, where only parts of a string are reversed. We define the pseudo-inversion of a string \(w = uxv\) to be the set of all strings \(v^Rxu^R\), where \(uv \ne \lambda \) and consider the operation from a formal language theoretic viewpoint. We show that regular languages are closed under the pseudo-inversion operation whereas context-free languages are not. Furthermore, we study the iterated pseudo-inversion operation and show that the iterated pseudo-inversion of a context-free language is recognized by a nondeterministic reversal-bounded multicounter machine. Finally, we introduce the notion of pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We demonstrate that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages.     

Scalable digital hardware for a trapped ion quantum computer

Quantum Information Processing - Many of the challenges of scaling quantum computer hardware lie at the interface between the qubits and the classical control signals used to manipulate them....     

Inertial effects on cylindrical particle migration in linear shear flow near a wall

Micro-/nanoparticle-based systems are regarded as one of the possible candidates due to the engineerability and multifunctionality to maximize the accumulation of the nano-/microparticle-based drug delivery system on the target. Recent advances in nanotechnology enable the fabrication of diverse particle shapes from simple spherical particles to more complex shapes. The particle dynamics in blood flow and endocytosis characteristics of non-spherical particles change as the non-sphericity effect increases. We used a numerical approach to investigate the particle dynamics in linear shear flow near a wall. We examined the dynamics of slender cylindrical particles with aspect ratio γ = 5.0 in terms of particle trajectory, velocity, and force variation for different Stokes numbers over time. We identified the rotating inertia of particle near a wall as the source of inertial migration toward the wall. The drift velocity of slender cylindrical particles is comparable to that of discoidal particles. We discuss the possibilities and limitations of using slender cylindrical particles as a drug delivery system.     

Nonparametric approach for uncertainty-based multidisciplinary design optimization considering limited data

Uncertainty-based multidisciplinary design optimization (UMDO) has been widely acknowledged as an advanced methodology to address competing objectives and reliable constraints of complex systems by coupling relationship of disciplines involved in the system. UMDO process consists of three parts. Two parts are to define the system with uncertainty and to formulate the design optimization problem. The third part is to quantitatively analyze the uncertainty of the system output considering the uncertainty propagation in the multidiscipline analysis. One of the major issues in the UMDO research is that the uncertainty propagation makes uncertainty analysis difficult in the complex system. The conventional methods are based on the parametric approach could possibly cause the error when the parametric approach has ill-estimated distribution because data is often insufficient or limited. Therefore, it is required to develop a nonparametric approach to directly use data. In this work, the nonparametric approach for uncertainty-based multidisciplinary design optimization considering limited data is proposed. To handle limited data, three processes are also adopted. To verify the performance of the proposed method, mathematical and engineering examples are illustrated.     

A disturbance observer based practical coordinated tracking controller for uncertain heterogeneous multi‐agent systems

This paper presents a coordinated tracking controller for multi‐agent systems. We assume that agents are uncertain, nonidentical, and affected by external disturbances. The information available to the tracking controller is a weighted sum of relative measurements. A coordinated tracking controller based on the disturbance observer, which is known as a robust output feedback controller, is designed so that the disturbances acting on agents are attenuated and at the same time the weighted sum of relative measurements approximately satisfies a differential equation defined by the leader's dynamics, which results in practical coordinated tracking. Systematic design procedures of the controller as well as numerical simulations are provided. Copyright © 2014 John Wiley & Sons, Ltd.     

Formation stabilization and resizing based on the control of inter‐agent distances

We propose a control strategy that could steer the group of mobile agents in the plane to achieve a specified formation. The control law could be implemented in a fully decentralized manner so that each agent moves on their own local reference frame. Under the acyclic minimally persistent graph topology, each agent measures the relative displacements of neighboring agents and then adjusts the distances between them to achieve the desired formation. As well as achieving a fixed formation, we could resize the formation only by changing the leader edge, which connects the leader with the first‐follower in acyclic minimally persistent graph, without changing the structures of the control law. Copyright © 2014 John Wiley & Sons, Ltd.